Strongly self-centered orientation of completek-partite graphs

Unmixed $r$-partite graphs

‎Unmixed bipartite graphs have been characterized by Ravindra and‎ ‎Villarreal independently‎. ‎Our aim in this paper is to‎ ‎characterize unmixed $r$-partite graphs under a certain condition‎, ‎which is a generalization of Villarreal's theorem on bipartite‎ ‎graphs‎. ‎Also, we give some examples and counterexamples in relevance to this subject‎.

Forced Orientation of Graphs

Certain t-partite graphs

By making use of the generalized concept of orthogonality in Latin squares, certain t-partite graphs have been constructed and a suggestion for a net work system has been made.

On strongly 2-multiplicative graphs

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

Factors of r-partite graphs

We give sufficient conditions for a tripartite graph to have a spanning subgraph consisting of complete graphs of order 3. This is applied to bound the strong chromatic number of a graph.